More Greedy De ning Sets in Latin Squares
نویسنده
چکیده
A Greedy De ning Set is a set of entries in a Latin square with the property that when the square is systematically lled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest Greedy De ning Set for any Latin square of order n. We give theorems on the upper bounds of g(n) and a table listing upper bounds of g(n) for small values of n. For a circulant Latin square, we nd that the size of the smallest Greedy De ning Set is b (n(n 1) 6 c.
منابع مشابه
Greedy defining sets in graphs and Latin squares
Greedy algorithm sometimes uses more than χ(G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring results in a minimum coloring of an order graph G. In this note we report some of the previous results as well as new results on greedy defining sets of graphs and Latin squares.
متن کاملMore results on greedy defining sets
The greedy defining sets of graphs were appeared first time in [M. Zaker, Greedy defining sets of graphs, Australas. J. Combin, 2001]. We show that to determine the greedy defining number of bipartite graphs is an NP-complete problem. This result answers affirmatively the problem mentioned in the previous paper. It is also shown that this number for forests can be determined in polynomial time....
متن کاملMore greedy defining sets in Latin squares
A Greedy Defining Set is a set of entries in a Latin Square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest defining set for any Latin Square of order n. We give theorems on the upper bounds of gn and a table listing upper bounds of gn for small values of n. For a circulant Latin square, we find ...
متن کاملPermutation Polynomials Modulo w
We give an exact characterization of permutation polynomials mod ulo n w w a polynomial P x a a x adx d with integral coe cients is a permutation polynomial modulo n if and only if a is odd a a a is even and a a a is even We also characterize polynomials de ning latin squares mod ulo n w but prove that polynomial multipermutations that is a pair of polynomials de ning a pair of orthogonal latin...
متن کاملDiscrete phase-space approach to mutually orthogonal Latin squares
Abstract. We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions. A complete set of such monomials defines a mutually unbiased basis (MUB) and may be associated with a complete set of mutually orthogonal Latin squares (MOLS). We translate some possible operations on the monomial ...
متن کامل